Convergence condition of simulated quantum annealing for closed and open systems
نویسندگان
چکیده
Simulated quantum annealing is a generic classical protocol to simulate some aspects of and sometimes regarded as alternative in finding the ground state Ising model. We derive condition for simulated converge thermal equilibrium at given, typically low, temperature. Both closed open systems are treated. rewrite master equation into an imaginary-time Schr\"odinger equation, which we apply variant asymptotic adiabatic deduce convergence condition. The result agrees qualitatively with rigorous systems, was derived from theory inhomogeneous Markov processes. Also observed qualitative agreement under real-time dynamics. This coincidence conditions stochastic processes dynamics highly nontrivial calls further scrutiny.
منابع مشابه
Convergence theorems for quantum annealing
Abstract. We prove several theorems to give sufficient conditions for convergence of quantum annealing, which is a protocol to solve generic optimization problems by quantum dynamics. In particular the property of strong ergodicity is proved for the path-integral Monte Carlo implementation of quantum annealing for the transverse Ising model under a power decay of the transverse field. This resu...
متن کاملQuantum Simulated Annealing
We develop a quantum algorithm to solve combinatorial optimization problems through quantum simulation of a classical annealing process. Our algorithm combines techniques from quantum walks, quantum phase estimation, and quantum Zeno effect. It can be viewed as a quantum analogue of the discrete-time Markov chain Monte Carlo implementation of classical simulated annealing. Our implementation re...
متن کاملQuantum Simulated Annealing Algorithm
Received on:2/6/2009 Accepted on:1/4/2010 Abstract Simulated annealing (SA) has been considered as a good tool for search and optimization problems which represent the abstraction of obtaining the crystalline structure through a physical process. This algorithm works sequentially that the current state will produce only one next state. That will make the search to be slower and the important dr...
متن کاملOn the convergence of Parallel Simulated Annealing
Using the Matrix-Tree Theorem and coupling methods the convergence of the Parallel Chain (PC) algorithm to the set of global minima is established for various selection functions. It is illustrated that there may be convergence to a set of non-global minima when selecting one of the best states (Best-Wins strategy). In the latter case the convergence of the homogeneous PC algorithm is proved fo...
متن کاملOn the Convergence Time of Simulated Annealing
Simulated Annealing is a family of randomized algorithms used to solve many combinatorial optimization problems. In practice they have been applied to solve some presumably hard (e.g., NP-complete) problems. The level of performance obtained has been promised [5, 2, 6, 14]. The success of its heuristic technique has motivated analysis of this algorithm from a theoretical point of view. In parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2022
ISSN: ['1538-4446', '1050-2947', '1094-1622']
DOI: https://doi.org/10.1103/physreva.106.062614